The Lattice of Compatible Quasiorders of Acyclic Monounary Algebras
نویسندگان
چکیده
Acyclic monounary algebras are characterized by the property that any compatible partial order r can be extended to a compatible linear order. In the case of rooted monounary algebras A = (A, f ) we characterize the intersection of compatible linear extensions of r by several equivalent conditions and generalize these results to compatible quasiorders of A. We show that the lattice QuordA of compatible quasiorders is a disjoint union of semi-intervals whose maximal elements equal the intersection of their compatible quasilinear extensions. We also investigate algebraic properties of the lattices QuordA and ConA.
منابع مشابه
Algebraic Approach to Locally Finite Trees with One End
Let T be an infinite locally finite tree. We say that T has exactly one end, if in T any two one-way infinite paths have a common rest (infinite subpath). The paper describes the structure of such trees and tries to formalize it by algebraic means, namely by means of acyclic monounary algebras or tree semilattices. In these algebraic structures the homomorpisms and direct products are considere...
متن کاملOn a Cancellation Law for Monounary Algebras
In this paper we investigate the validity of a cancellation law for some classes of monounary algebras.
متن کاملQUANTALE-VALUED SUP-ALGEBRAS
Based on the notion of $Q$-sup-lattices (a fuzzy counterpart of complete join-semilattices valuated in a commutative quantale), we present the concept of $Q$-sup-algebras -- $Q$-sup-lattices endowed with a collection of finitary operations compatible with the fuzzy joins. Similarly to the crisp case investigated in cite{zhang-laan}, we characterize their subalgebras and quotients, and following...
متن کاملLattice of full soft Lie algebra
In this paper, we study the relation between the soft sets and soft Lie algebras with the lattice theory. We introduce the concepts of the lattice of soft sets, full soft sets and soft Lie algebras and next, we verify some properties of them. We prove that the lattice of the soft sets on a fixed parameter set is isomorphic to the power set of a ...
متن کاملInformation Completeness in Nelson Algebras of Rough Sets Induced by Quasiorders
Rough set systems induced by equivalences have been proved to exhibit polymorphic logical behaviours in dependence on the extension of the set of completely defined objects. They give a rise to semi-simple Nelson algebras, hence three-valued Lukasiewicz algebras and regular double Stone algebras. Additionally, it has been shown that in the presence of completely defined objects, they fulfil a f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Order
دوره 28 شماره
صفحات -
تاریخ انتشار 2011